A note on estimates for the spectral radius of a nonnegative matrix
نویسندگان
چکیده
Utilizing the concept of Perron complement, a new estimate for the spectral radius of a nonnegative irreducible matrix is presented. A new matrix is derived that preserves the spectral radius while its minimum row sum increases and its maximum row sum decreases. Numerical examples are provided to illustrate the effectiveness of this approach.
منابع مشابه
The Sign-Real Spectral Radius for Real Tensors
In this paper a new quantity for real tensors, the sign-real spectral radius, is defined and investigated. Various characterizations, bounds and some properties are derived. In certain aspects our quantity shows similar behavior to the spectral radius of a nonnegative tensor. In fact, we generalize the Perron Frobenius theorem for nonnegative tensors to the class of real tensors.
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملEla a Note on Estimates for the Spectral Radius of a Nonnegative Matrix∗
Utilizing the concept of Perron complement, a new estimate for the spectral radius of a nonnegative irreducible matrix is presented. A new matrix is derived that preserves the spectral radius while its minimum row sum increases and its maximum row sum decreases. Numerical examples are provided to illustrate the effectiveness of this approach.
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملA note on the bounds of Laplacian-energy-like-invariant
The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017